Sparse Certificates and Scan-First Search
نویسندگان
چکیده
An algorithm for the parallel construction of k-connectivity certificates for graphs, Scan-First Search, was introduced by Joseph Cheriyan, Ming-Yang Kao, and Ramakrishna Thurimella in their paper Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for KVertex Connectivity.[2] The following is an attempt to clarify and simplify the concepts and proofs presented in that paper.
منابع مشابه
Certificates for Triangular Equivalence and Rank Profiles
In this paper, we give novel certificates for triangular equivalence and rank profiles. These certificates enable to verify the row or column rank profiles or the whole rank profile matrix faster than recomputing them, with a negligible overall overhead. We first provide quadratic time and space non-interactive certificates saving the logarithmic factors of previously known ones. Then we propos...
متن کاملSparse-based Reconstruction for DOA Estimation using non-Exhaustive Search
A sparse-based direction-of-arrival (DOA) estimation recently gains a lot of attention due to its capability to reduce the number of samples significantly. However, this capability has to be paid by a heavy computation at the reconstruction side. Previous researches have addressed this problem, for example, by utilizing the unitary transform to change a complex-valued reconstruction problem to ...
متن کاملA First Look at the CT Landscape: Certificate Transparency Logs in Practice
Many of today’s web-based services rely heavily on secure end-to-end connections. The “trust” that these services require builds upon TLS/SSL. Unfortunately, TLS/SSL is highly vulnerable to compromised Certificate Authorities (CAs) and the certificates they generate. Certificate Transparency (CT) provides a way to monitor and audit certificates and certificate chains, to help improve the overal...
متن کاملCertificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs
In this paper, we present sparse certificates for biconnectivity together with algorithms for updating these certificates. We thus obtain fully-dynamic algorithms for biconnectivity in graphs that run in O( √ n log n logdn e) amortized time per operation, where m is the number of edges and n is the number of nodes in the graph. This improves upon the results in [12], in which algorithms were pr...
متن کاملInteractive certificate for the verification of Wiedemann's Krylov sequence: application to the certification of the determinant, the minimal and the characteristic polynomials of sparse matrices
Certificates to a linear algebra computation are additional data structures for each output, which can be used by a—possibly randomized— verification algorithm that proves the correctness of each output. Wiedemann’s algorithm projects the Krylov sequence obtained by repeatedly multiplying a vector by a matrix to obtain a linearly recurrent sequence. The minimal polynomial of this sequence divid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013